全文获取类型
收费全文 | 86076篇 |
免费 | 6871篇 |
国内免费 | 5491篇 |
专业分类
化学 | 24039篇 |
晶体学 | 1807篇 |
力学 | 3819篇 |
综合类 | 423篇 |
数学 | 24401篇 |
物理学 | 43949篇 |
出版年
2023年 | 236篇 |
2022年 | 229篇 |
2021年 | 409篇 |
2020年 | 775篇 |
2019年 | 1091篇 |
2018年 | 1025篇 |
2017年 | 771篇 |
2016年 | 593篇 |
2015年 | 559篇 |
2014年 | 1358篇 |
2013年 | 2158篇 |
2012年 | 1384篇 |
2011年 | 2042篇 |
2010年 | 2602篇 |
2009年 | 7205篇 |
2008年 | 8348篇 |
2007年 | 6823篇 |
2006年 | 6193篇 |
2005年 | 4330篇 |
2004年 | 4046篇 |
2003年 | 4278篇 |
2002年 | 5437篇 |
2001年 | 3944篇 |
2000年 | 3676篇 |
1999年 | 3477篇 |
1998年 | 2890篇 |
1997年 | 2071篇 |
1996年 | 1828篇 |
1995年 | 2260篇 |
1994年 | 2188篇 |
1993年 | 1645篇 |
1992年 | 1148篇 |
1991年 | 879篇 |
1990年 | 705篇 |
1989年 | 629篇 |
1988年 | 595篇 |
1987年 | 420篇 |
1985年 | 980篇 |
1984年 | 643篇 |
1983年 | 506篇 |
1982年 | 662篇 |
1981年 | 822篇 |
1980年 | 738篇 |
1979年 | 584篇 |
1978年 | 605篇 |
1977年 | 555篇 |
1976年 | 554篇 |
1975年 | 319篇 |
1974年 | 360篇 |
1973年 | 468篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
11.
12.
13.
14.
Theo Steininger Jait Dixit Philipp Frank Maksim Greiner Sebastian Hutschenreuter Jakob Knollmüller Reimar Leike Natalia Porqueres Daniel Pumpe Martin Reinecke Matev raml Csongor Varady Torsten Enßlin 《Annalen der Physik》2019,531(3)
NIFTy , “Numerical Information Field Theory,” is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing the user to focus on the algorithmic design. Under the hood, NIFTy ensures that the discretization of the implemented equations is consistent. This enables the user to prototype an algorithm rapidly in 1D and then apply it to high‐dimensional real‐world problems. This paper introduces NIFTy 3, a major upgrade to the original NIFTy framework. NIFTy 3 allows the user to run inference algorithms on massively parallel high performance computing clusters without changing the implementation of the field equations. It supports n‐dimensional Cartesian spaces, spherical spaces, power spaces, and product spaces as well as transforms to their harmonic counterparts. Furthermore, NIFTy 3 is able to handle non‐scalar fields, such as vector or tensor fields. The functionality and performance of the software package is demonstrated with example code, which implements a mock inference inspired by a real‐world algorithm from the realm of information field theory. NIFTy 3 is open‐source software available under the GNU General Public License v3 (GPL‐3) at https://gitlab.mpcdf.mpg.de/ift/NIFTy/tree/NIFTy_3 . 相似文献
15.
Pham Duy Khanh Tran Hong Mo Trinh T. T. Tran 《Numerical Functional Analysis & Optimization》2019,40(8):924-943
Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example. 相似文献
16.
This paper develops a framework to deal with the unconditional superclose analysis of
nonlinear parabolic equation. Taking the finite element pair $Q_{11}/Q_{01} × Q_{10}$ as an example,
a new mixed finite element method (FEM) is established and the $τ$ -independent superclose
results of the original variable $u$ in $H^1$-norm and the flux variable $\mathop{q} \limits ^{\rightarrow}= −a(u)∇u$ in $L^2$-norm are deduced ($τ$ is the temporal partition parameter). A key to our analysis is an
error splitting technique, with which the time-discrete and the spatial-discrete systems are
constructed, respectively. For the first system, the boundedness of the temporal errors is obtained. For the second system, the spatial superclose results are presented unconditionally, while the previous literature always only obtain the convergent estimates or require
certain time step conditions. Finally, some numerical results are provided to confirm the
theoretical analysis, and show the efficiency of the proposed method. 相似文献
17.
18.
19.
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time. 相似文献
20.
In the present paper, we give an answer to a question which is closely related to doubly warped product of Finsler metrics: ‘‘For each n, is there an n-dimensional Finsler manifold , admitting a non-constant smooth function f on M such that ?”. We relate the preceding mentioned condition to different concepts appeared and studied in Finsler geometry. We introduce and investigate the notion of a semi concurrent vector field on a Finsler manifold. We show that some special Finsler manifolds admitting such vector fields turn out to be Riemannian. We prove that Tachibana's characterization of Finsler manifolds admitting a concurrent vector field leads to Riemannian metrics. Various examples for conic Finsler spaces that admit semi-concurrent vector field are presented. 相似文献